| Definitions | s = t, t  T, x:A  B(x),  x:A. B(x), ES, EState(T), a:A fp B(a), f(a), Id,  , strong-subtype(A;B), P   Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e',  ,  b, constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), Void,  x:A.B(x), Top, S  T, suptype(S; T), first(e),  A, <a, b>, pred(e), x.A(x), x. t(x), P & Q, chain_config(), E, AbsInterface(A), chain_sys(Cmd), let x,y = A in B(x;y), t.1, e  X, loc(e), {x:A| B(x)} , E(X), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , X(e), cctail?(x), ff, inr x , "$token", inl x , tt, Atom, False, True, A c B,  e<e'.P(e), (e <loc e'), tail-dcdr{i:l}(es;Config), (I|p), Sys(valid), Dec(P), Output |